Continuous time programming with set-inclusive constraints and objective set

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set Constraints and Logic Programming

Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet They are the main ingredient in set based program analysis In this paper we describe a constraint logic programming language clp sc over set constraints in the style of Ja ar and Lassez The language subsumes ordinary logic programs over an Herbrand domain We give an e cient uni catio...

متن کامل

Continuous-time Distributed Convex Optimization with Set Constraints ⋆

We study a distributed convex optimization problem with set constraints. The objective function is a summation of strictly convex functions. Based on a multi-agent system formulation, we consider that each node is with continuous-time dynamics and can only access its local objective function. Meanwhile, each node is subject to a common convex set constraint. The nodes can exchange local informa...

متن کامل

Modelling Grammar Constraints with Answer Set Programming

Representing and solving constraint satisfaction problems is one of the challenges of artificial intelligence. In this paper, we present answer set programming (ASP) models for an important and very general class of constraints, including all constraints specified via grammars or automata that recognise some formal language. We argue that our techniques are effective and efficient, e.g., unit-p...

متن کامل

Set Constraints in Logic Programming

We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form 〈X,F〉 where X is a finite set of propositional atoms and F is an arbitrary family of subsets of X. We call such atoms set constaints and show that the concept of stable model can be generalized to programs admitting set constraints b...

متن کامل

DEA common set of weights based on a multi objective Fractional Programming

Data envelopment analysis operates as a tool for appraising the relative efficiency of a set of homogenous decision making units. This methodology is applied widely in different contexts. Regarding to its logic, DEA allows each DMU to take its optimal weight in comparison with other DMUs while a similar condition is considered for other units. This feature is a bilabial characteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1983

ISSN: 0022-247X

DOI: 10.1016/0022-247x(83)90158-0